Axioms for behavioural congruence of single-pass instruction sequences
نویسندگان
چکیده
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on instruction sequences are paid attention to: instruction sequence congruence, structural congruence, and behavioural congruence. Sound and complete axiom systems for the first two congruences were already given in early papers on program algebra. The current paper is the first one that is concerned with an axiom system for the third congruence. The presented axiom system is especially notable for its axioms that have to do with forward jump instructions.
منابع مشابه
Periodic Single-Pass Instruction Sequences
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs. The resulting mathematical structure is a semigroup. We show that a kernel of this syntax can replace PGA as a carrier for program algebra by providing axioms for defining single-pass congruence an...
متن کاملAn Instruction Sequence Semigroup with Repeaters
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs. The resulting mathematical structure is a semigroup. We show that a kernel of this syntax can replace PGA as a carrier for program algebra by providing axioms for defining single-pass congruence an...
متن کاملProgram Algebra with Repeat Instruction
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction is designed to represent infinite sequences of instructions as finite, linear programs. The resulting program notation is called PGLA and can be considered a string syntax for PGA. We redefine the repeat instruction by allowing its counter to be also zero. Then we show that PGLAcore, a kernel of...
متن کاملA Hoare-like logic of asserted single-pass instruction sequences
We present a formal system for proving the partial correct-ness of a single-pass instruction sequence as considered in program algebra by decomposition into proofs of the partial correctness of segments of the single-pass instruction sequence concerned. The system is similar to Hoare logics, but takes into account that, by the presence of jump instructions , segments of single-pass instruction ...
متن کاملInstruction sequences for the production of processes
Single-pass instruction sequences under execution are considered to produce behaviours to be controlled by some execution environment. Threads as considered in thread algebra model such behaviours: upon each action performed by a thread, a reply from its execution environment determines how the thread proceeds. Threads in turn can be looked upon as producing processes as considered in process a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Sci. Ann. Comp. Sci.
دوره 27 شماره
صفحات -
تاریخ انتشار 2017